scheduling in container terminals using network simplex algorithm
Authors
abstract
in static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. in this paper, the static scheduling problem of automated guided vehicles in container terminal is solved by the network simplex algorithm (nsa). the algorithm is based on graph model and their performances are at least 100 times faster than traditional simplex algorithm for linear programs. many random data are generated and fed to the model for 50 vehicles. the results show that nsa is fast and efficient. it is found that, in practice, nsa takes polynomial time to solve problems in this application.
similar resources
Scheduling in Container Terminals using Network Simplex Algorithm
In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by the Network Simplex Algorithm (NSA). The algorithm is based on graph model and their performances are at least 100 times faster than traditional si...
full textscheduling in container terminals using network simplex algorithm
in static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. in this paper, the static scheduling problem of automated guided vehicles in container terminal is solved by the network simplex algorithm (nsa). the algorithm is based on graph model and their performances are at least 100 times faster than traditional si...
full textYard crane scheduling in port container terminals using genetic algorithm
Yard crane is an important resource in container terminals. Efficient utilization of the yard crane significantly improves the productivity and the profitability of the container terminal. This paper presents a mixed integer programming model for the yard crane scheduling problem with non- interference constraint that is NPHARD in nature. In other words, one of the most important constraints in...
full textyard crane scheduling in port container terminals using genetic algorithm
yard crane is an important resource in container terminals. efficient utilization of the yard crane significantly improves the productivity and the profitability of the container terminal. this paper presents a mixed integer programming model for the yard crane scheduling problem with non- interference constraint that is nphard in nature. in other words, one of the most important constraints in...
full textScheduling Single-Load and Multi-Load AGVs in Container Terminals
In this paper, three solutions for scheduling problem of the Single-Load and Multi-Load Automated Guided Vehicles (AGVs) in Container Terminals are proposed. The problem is formulated as Constraint Satisfaction and Optimization. When capacity of the vehicles is one container, the problem is a minimum cost flow model. This model is solved by the highest performance Algorithm, i.e. Network Simple...
full textQuay Cranes and Yard Trucks Scheduling Problem at Container Terminals
A bi-objective mathematical model is developed to simultaneously consider the quay crane and yard truck scheduling problems at container terminals. Main real-world assumptions, such as quay cranes with non-crossing constraints, quay cranes’ safety margins and precedence constraints are considered in this model. This integrated approach leads to better efficiency and productivity at container te...
full textMy Resources
Save resource for easier access later
Journal title:
journal of optimization in industrial engineeringجلد ۲۰۱۰، شماره ۰۲، صفحات ۹-۱۶
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023